#define LENGTH 40

int succ[LENGTH];

int fibonacci (int j) {
	int i;
	if(j<LENGTH){
		succ[0] = 0;
		succ[1] = 1;
	
		for (i = 2; i < j; i++) {
			succ[i] = succ[i-1] + succ[i-2];
		}
	}
	
}
